Fast and powerful hashing using tabulation
نویسندگان
چکیده
منابع مشابه
Tabulation Based 5-Universal Hashing and Linear Probing
Previously [SODA’04] we devised the fastest known algorithm for 4-universal hashing. The hashing was based on small pre-computed 4-universal tables. This led to a five-fold improvement in speed over direct methods based on degree 3 polynomials. In this paper, we show that if the pre-computed tables are made 5-universal, then the hash value becomes 5universal without any other change to the comp...
متن کاملFast Embedded Software Hashing
We present new software speed records for several popular hash functions on low-end 8-bit AVR microcontrollers. Target algorithms include widely deployed hash functions like SHA-1 and SHA-256 as well as the SHA-3 (second round) candidates Blake-32 and Skein-256. A significant aspect of our implementations is that they reduce the overall resource requirements, improving not only execution time b...
متن کاملFast Robust Hashing
As stateful flow-aware services are becoming commonplace, distributed router architectures have to quickly assign packets being forwarded to service-specialized processors in order to balance flow processing and state among them. Moreover, packets belonging to the same flow must be always assigned to the same CPU, even if some of the service processors become unavailable. This paper presents tw...
متن کاملFast Hashing on the
With the advent of the Pentium processor parallelization nally became available to Intel based computer systems. One of the design principles of the MD4-family of hash functions (MD4, MD5, SHA-1, RIPEMD-160) is to be fast on the 32-bit Intel processors. This paper shows that carefully coded implementations of these hash functions are able to exploit the Pentium's superscalar architecture to its...
متن کاملFast and Robust Projective Matching for Fingerprints Using Geometric Hashing
Fingerprint matching is the most important module in automatic person recognition using fingerprints. We model the nonlinear distortions and noise obtained during the fingerprint capture process as transformations in the projective domain. Matching of the fingerprints involves computing the homography matrix for the projective transformation, mapping of the minutia points by this homography and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications of the ACM
سال: 2017
ISSN: 0001-0782,1557-7317
DOI: 10.1145/3068772